منابع مشابه
Interval Graph Representation with Given Interval and Intersection Lengths
We consider the problem of finding interval representations of graphs that additionally respect given interval lengths and/or pairwise intersection lengths, which are represented as weight functions on the vertices and edges, respectively. Pe’er and Shamir proved that the problem is NP-complete if only the former are given [SIAM J. Discr. Math. 10.4, 1997]. We give both a linear-time and a logs...
متن کاملOn Generalized Interval Orders
In this paper, we introduce the notion of generalized interval order (GIO) which extends the notion of interval order in non-transitive binary relations. This allow us to extend the classical representation theorem of Fishburn in [5]. We also provide sufficient conditions which ensure the existence of the Generalized Optimal Choice Set (GOCS) of GIOs. Finally, we characterize the existence of t...
متن کاملInterval orders and dimension
We show that for every interval order X , there exists an integer t so that if Y is any interval order with dimension at least t, then Y contains a subposet isomorphic to X .
متن کاملHomothetic interval orders
We give a characterization of the non-empty binary relations  on a N∗-set A such that there exist two morphisms of N∗-sets u1, u2 : A → R+ verifying u1 ≤ u2 and x  y ⇔ u1(x) > u2(y). They are called homothetic interval orders. If  is a homothetic interval order, we also give a representation of  in terms of one morphism of N∗-sets u : A → R+ and a map σ : u(R+) × A → R+ such that x  y ⇔ σ(...
متن کاملSimultaneous Representation of Interval and Interval-Containment Orders
We characterize the polysemic interval pairs|pairs of posets that admit simultaneous interval and interval-containment representations|and present algorithms to recognize them and construct polysemic interval representations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2019
ISSN: 0166-218X
DOI: 10.1016/j.dam.2019.06.021